Distributed Genetic Programming with Mobile Agents

نویسندگان

  • Robert A. Ghanea-Hercock
  • Divine T. Ndumu
  • Jaron C. Collis
چکیده

This paper presents a system for accessing the potential of Genetic Programming [Koza 1992] by exploiting the availability of computer networks to distribute the computational load over a large number of machines. The goal is to utilise the CPU and memory resources of Intranet systems, to facilitate GP operations. In addition the use of a large-scale parallel network of machines allows a demetic grouping of subpopulations to be created, in order to enhance the genetic diversity within a GP system. While several existing schemes for parallelisation of GP exist, (e.g. Andre & Koza 1996) this work demonstrates how Java based mobile agents are ideally suited to this task. An intelligent agent infrastructure has been created, which assists a user by automating the deployment and monitoring of a parallel GP system using mobile agents. The major benefits realised are greater cost efficiency in utilising available computer power and ease of use.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paradigm-Oriented Distributed Computing using Mobile Agents

We describe the implementation underlying an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigmoriented distributed computing is that the user only needs to specify application-specific sequential code, while the underlying infrastructure takes care of the parallelization and distribution. The main features of the proposed approac...

متن کامل

Mobile Agents For Implementing Local Computations in Graphs

Mobile agents are a recent paradigm to facilitate the design and programming of distributed applications. However, whilst their popularity continues to grow, a uniform theory of mobile agent systems is not yet su ciently elaborated, in comparison with classical models of distributed computation. In this paper we show how to use mobile agents as an alternative model for implementing distributed ...

متن کامل

DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs

Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...

متن کامل

Dependable Mobile Agents

The mobile agent programming paradigm offers several advantages for the development of distributed systems and applications. Mobile agent dependability is a key requirement for the acceptance and future development and deployment of mobile agents. In this paper, we propose a replication scheme for mobile agents based on the group concept and associated group communication services. Group commun...

متن کامل

Migration Intelligence for Mobile Agents

Mobile agents can be considered to be a new design paradigm in the area of distributed programming. This paper deals with problems of mobile agents which should be able to achieve a user-given task autonomously. In search of a “good enough” solution, the agent should be able to find new places and should move “fast enough” through the network. Can “migration intelligence” help to solve these pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999